Quasi Kronecker products and a determinant formula
نویسندگان
چکیده
منابع مشابه
Kronecker Products and BIBDs
Recursive constructions are given which permit, under conditions described in the paper, a (v, b, r, k, lambda)configuration to be used to obtain a (v', b', r', k, lambda)-configuration. Although there are many equivalent definitions we will mean by a (v, b, r, k, lambda)-configuration or BIBD that (0, 1)-matrix A of size v x b with row sum r and column sum k satisfying AAT = (r lambda)I + lamb...
متن کاملPermanent versus determinant, obstructions, and Kronecker coefficients
We give an introduction to some of the recent ideas that go under the name “geometric complexity theory”. We first sketch the proof of the known upper and lower bounds for the determinantal complexity of the permanent. We then introduce the concept of a representation theoretic obstruction, which has close links to algebraic combinatorics, and we explain some of the insights gained so far. In p...
متن کاملUnimodality via Kronecker Products
We present new proofs and generalizations of unimodality of the q-binomial coefficients ( n k ) q as polynomials in q. We use an algebraic approach by interpreting the differences between numbers of certain partitions as Kronecker coefficients of representations of Sn. Other applications of this approach include strict unimodality of the diagonal q-binomial coefficients and unimodality of certa...
متن کاملZeta Determinant for Double Sequences of Spectral Type and a Generalization of the Kronecker First Limit Formula
The Kronecker first limit formula in the number field K is an expression of the value of the constant term in the Laurent expansion at s = 1 of the partial Dedekind zeta function ζA(s), associated to an ideal class A of K (see Section 4.1 for details), and has deep applications in number theory. When K is the rational number field or an imaginary quadratic field such formulas are classical and ...
متن کاملOn a Kronecker products sum distance bounds
Abstract— binary linear error correcting codes represented by two code families Kronecker products sum are considered. The dimension and distance of new code is investigated. Upper and lower bounds of distance are obtained. Some examples are given. It is shown that some classic constructions are the private cases of considered one. The subclass of codes with equal lower and upper distance bound...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2018
ISSN: 0024-3795
DOI: 10.1016/j.laa.2017.09.011